Constant-time distributed dominating set approximation
نویسندگان
چکیده
منابع مشابه
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
This paper presents a near-optimal distributed approximation algorithm for the minimumweight connected dominating set (MCDS) problem. We use the standard distributed message passing model called the CONGEST model in which in each round each node can send O(log n) bits to each neighbor. The presented algorithm finds an O(log n) approximation in Õ(D+ √ n) rounds, where D is the network diameter a...
متن کاملParameterized approximation of dominating set problems
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a dominating set of size at most g(k), where g(k) is some fixed function of k. Such an outcome is termed an FPT approximation algorithm. We describe some results that begin to provide some answers. We show that there is n...
متن کاملApproximation hardness of edge dominating set problems
We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs, Minimum Edge Dominating Set and Minimum Maximal Matching. We show that it is NP-hard to approximate the solution of both problems to within any constant factor smaller than 7 6 . The result extends with negligible loss to bounded degree graphs and to every...
متن کاملA local constant factor approximation for the minimum dominating set problem on bounded genus graphs
The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, several breakthroughs have been made on computing local approximations on sparse graphs. This paper presents a de...
متن کاملThe first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs
The idea of virtual backbone has emerged to improve the efficiency of flooding based routing algorithms for wireless networks. The effectiveness of virtual backbone can be improved as its size decreases. The minimum connected dominating set (CDS) problem was used to compute minimum size virtual backbone. However, as this formulation requires the virtual backbone nodes to connect all other nodes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2005
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-004-0112-5